Efficient Steiner Tree Construction Based on Spanning Graphs
نویسندگان
چکیده
منابع مشابه
Minimum Steiner Tree Construction
In optimizing the area of Very Large Scale Integrated (VLSI) layouts, circuit interconnections should generally be realized with minimum total interconnect. This chapter addresses several variations of the corresponding fundamental Steiner minimal tree (SMT) problem, where a given set of pins is to be connected using minimum total wirelength. Steiner trees are important in global routing and wi...
متن کاملEfficient Algorithms for Steiner Edge Connectivity Computation and Gomory-Hu Tree Construction for Unweighted Graphs
We first consider the Steiner edge connectivity problem on an unweighted undirected or Eulerian directed graph with n vertices and m edges. This problem involves finding the edge connectivity of a specified subset S of vertices, i.e. the cardinality of the minimum cut in the graph that separates the vertices in S into two parts. We give a deterministic algorithm for this problem that runs in Õ(...
متن کاملEfficient Rectilinear Steiner Tree Construction with Rectangular Obstacles
Rectilinear Steiner Minimal Tree (RSMT) is one of the key problems in VLSI/ULSI physical design [1]. Given n points in a plane, a RSMT problem is to connect these points through some extra points called Steiner points to achieve a tree with minimal total wire length [2-4]. With the trend toward IPblock-based SoC design, the macro cells, such as memories, logic blocks, present in the design as o...
متن کاملTree Decomposition based Steiner Tree Computation over Large Graphs
In this paper, we present an exact algorithm for the Steiner tree problem. The algorithm is based on certain pre-computed index structures. Our algorithm offers a practical solution for the Steiner tree problems on graphs of large size and bounded number of terminals.
متن کاملOn Spanning Tree Congestion of Product Graphs
In this paper we consider the spanning tree congestion for several families of graphs. We find the exact spanning tree congestion for toroidal meshes, Cm×Cn, and cylindrical meshes, Pm×Cn,. Also we find bounds for the spanning tree congestion of Qn, and a construction that gives the upper bound.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 2004
ISSN: 0278-0070
DOI: 10.1109/tcad.2004.826557